Random Records and Cuttings in Binary Search Trees
نویسندگان
چکیده
منابع مشابه
Random Records and Cuttings in Binary Search Trees
We study the number of records in a random binary search tree on n randomly labelled vertices. Equivalently the number of random cuttings required to eliminate a random binary search tree can be studied. After normalization the distribution is shown to be asymptotically 1-stable.
متن کاملRandom Records and Cuttings in Complete Binary Trees
We study the number of records in a complete binary tree with randomly labeled vertices or edges. Equivalently, we may study the number of random cuttings required to eliminate a complete binary tree. The distribution is, after normalization, asymptotically a periodic function of lgn − lg lgn; thus there is no true asymptotic distribution but a family of limits of different subsequences; these ...
متن کاملProfile and Height of Random Binary Search Trees
The purpose of this article is to survey recent results on distributional properties of random binary search trees. In particular we consider the profile and the height.
متن کاملMaximal Clades in Random Binary Search Trees
We study maximal clades in random phylogenetic trees with the Yule–Harding model or, equivalently, in binary search trees. We use probabilistic methods to reprove and extend earlier results on moment asymptotics and asymptotic normality. In particular, we give an explanation of the curious phenomenon observed by Drmota, Fuchs and Lee (2014) that asymptotic normality holds, but one should normal...
متن کاملPatterns in random binary search trees
Ž . ABSTRACT: In a randomly grown binary search tree BST of size n, any fixed pattern occurs with a frequency that is on average proportional to n. Deviations from the average case are highly unlikely and well quantified by a Gaussian law. Trees with forbidden patterns occur with an exponentially small probability that is characterized in terms of Bessel functions. The results obtained extend t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Combinatorics, Probability and Computing
سال: 2010
ISSN: 0963-5483,1469-2163
DOI: 10.1017/s096354830999068x